Long-Range Percolation Mixing Time
نویسندگان
چکیده
We provide an estimate, sharp up to poly-logarithmic factors, of the asymptotically almost sure mixing time of the graph created by long-range percolation on the cycle of length N (Z/NZ). While it is known that the almost sure diameter drops from linear to poly-logarithmic as the exponent s decreases below 2 [4, 9], the almost sure mixing time drops from N only to N (up to poly-logarithmic factors).
منابع مشابه
Mixing under monotone censoring ∗
Consider critical percolation on a rhombus in the hexagonal lattice, and let A the event of a left to right crossing (by 1’s). Suppose we sample configurations from A by starting from some fixed configuration in A, and then at each step a uniformly random hexagon is resampled as long as the resulting configuration is in A. It is easy to see that this sampling procedure converges to the uniform ...
متن کاملOn the mixing time of simple random walk on the super critical percolation cluster
It is shown that the mixing time of simple random walk on the super critical cluster inside the n × ... × n box in Z is θ(n), and that the Cheeger constant of the cluster inside the box is θ(n).
متن کاملAn Exposition to Information Percolation for the Ising Model
Information percolation is a new method for analyzing stochastic spin systems through classifying and controlling the clusters of information-flow in the space-time slab. It yielded sharp mixing estimates (cutoff with an O(1)-window) for the Ising model on Z up to the critical temperature, as well as results on the effect of initial conditions on mixing. In this expository note we demonstrate t...
متن کاملLong-range correlated percolation and flow and transport in heterogeneous porous media
We introduce a percolation model with long-range correlations, and investigate ils scaling properties. Using this model, we provide a theoretical explanation for
متن کاملThe Sizes of Large Hierarchical Long-Range Percolation Clusters
We study a long-range percolation model in the hierarchical lattice ΩN of orderN where probability of connection between two nodes separated by distance k is of the form min{αβ−k, 1}, α ≥ 0 and β > 0. The parameter α is the percolation parameter, while β describes the long-range nature of the model. The ΩN is an example of so called ultrametric space, which has remarkable qualitative difference...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 17 شماره
صفحات -
تاریخ انتشار 2008